Lexisearch Approach to Travelling Salesman Problem
نویسندگان
چکیده
منابع مشابه
A Multilevel Approach to the Travelling Salesman Problem
We motivate, derive and implement a multilevel approach to the travelling salesman problem. The resulting algorithm progressively coarsens the problem, initialises a tour and then employs either the LinKernighan (LK) or the Chained Lin-Kernighan (CLK) algorithm to refine the solution on each of the coarsened problems in reverse order. In experiments on a well established test suite of 79 proble...
متن کاملA New Simulated Annealing Approach for Travelling Salesman Problem
The aim of this study is to improve searching capability of simulated annealing (SA) heuristic through integration of two new neighborhood mechanisms. Due to its ease of formulation, difficulty to solve and various real life applications several Travelling Salesman Problems (TSP) were selected from the literature for the testing of the proposed methods. The proposed methods were also compared t...
متن کاملA Travelling Salesman Approach to Protein Conformation
A simple method for finding conformational substates of proteins is presented and realized through computer simulations. It is based on a procedure in which the amino acids in a protein take the places of the cities in the three-dimensional travelling salesman prob lem. Optimization by simulated annealing was employed in the computer simulations to obtain conformational substates originating fr...
متن کاملA Lexisearch Algorithm for the Bottleneck Traveling Salesman Problem
The bottleneck traveling salesman problem (BTSP) is a variation of the well-known traveling salesman problem in which the objective is to minimize the maximum lap (arc length) in a tour of the salesman. In this paper, a lexisearch algorithm using adjacency representation for a tour has been developed for obtaining exact optimal solution to the problem. Then a comparative study has been carried ...
متن کاملThe multi-stripe travelling salesman problem
In the classical Travelling Salesman Problem (TSP), the objective function sums the costs for travelling from one city to the next city along the tour. In the q-stripe TSP with [Formula: see text], the objective function sums the costs for travelling from one city to each of the next q cities in the tour. The resulting q-stripe TSP generalizes the TSP and forms a special case of the quadratic a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOSR Journal of Mathematics
سال: 2013
ISSN: 2319-765X,2278-5728
DOI: 10.9790/5728-0640108